A Spectral Approach to Lower Bounds with Applications to Geometric Searching

Some Lower Bounds for Estrada Index

Geometric Range Searching and Its Relatives

About ten years ago, the eld of range searching, especially simplex range searching, was wide open. At that time, neither e cient algorithms nor nontrivial lower bounds were known for most range-searching problems. A series of papers by Haussler and Welzl [161], Clarkson [88, 89], and Clarkson and Shor [92] not only marked the beginning of a new chapter in geometric searching, but also revitali...

A note on the bounds of Laplacian-energy-like-invariant

The Laplacian-energy-like of a simple connected graph G is defined as LEL:=LEL(G)=∑_(i=1)^n√(μ_i ), Where μ_1 (G)≥μ_2 (G)≥⋯≥μ_n (G)=0 are the Laplacian eigenvalues of the graph G. Some upper and lower bounds for LEL are presented in this note. Moreover, throughout this work, some results related to lower bound of spectral radius of graph are obtained using the term of ΔG as the num...

Sharp Bounds on the PI Spectral Radius

In this paper some upper and lower bounds for the greatest eigenvalues of the PI and vertex PI matrices of a graph G are obtained. Those graphs for which these bounds are best possible are characterized.

The Effects of Openness and Globalization on Inflation: An ARDL Bounds Test Approach

Abstract The purpose of this paper is to test the hypothesis first proposed by Romer (1993); suggesting that inflation is lower in more open economies. According to this hypothesis, central banks have a lower incentive to engineer surprise inflations in more-open economies because the Phillips curve is steeper. Furthermore, Comparing with other empirical studies, this paper has used the new KOF...